Coded Cooperative Data Exchange for a Secret Key
نویسندگان
چکیده
منابع مشابه
Deterministic Algorithm for Coded Cooperative Data Exchange
We consider the problem of cooperative data exchange in a group of wireless clients. In this problem each client initially holds a subset of packets and needs to obtain all packets held by other clients. Each client can broadcast its own packets or a combinations thereof to other clients via an error-free broadcast channel. Assuming that clients know which packets are available to other clients...
متن کاملEulerian Secret Key Exchange ( Extended Abstract )
Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share information-theoretically secure keys that are secret from an eavesdropper. In this paper we first introduce the notion of an Eulerian secret key exchange, in which the pairs of players sharing secret keys form an Eulerian ...
متن کاملPhysical-Layer-Enhanced Wireless Secret Key Exchange
We address the problem of efficiently establishing a shared secret key over an open wireless channel in the presence of an active (jamming) adversary. A commonly employed technique in practice for key sharing is the cryptographic ellipticcurve Diffie-Hellman (DH) protocol; however, its communication cost in a jammed environment is very high. Hence, we employ novel physical-layer techniques to e...
متن کاملA N Efficient Key Exchange Protocol Based on Secret Sharing
Group key protocols are still an important research issue in the network security, generation and sharing the secret session key is the important factor during the the groupkey transfer protocols. Usually it will be taken care of KGC. KGC encrypts session keys under another secret key shared with each entity during registration. In this paper, we propose an authenticated key transfer protocol b...
متن کاملMultiparty Secret Key Exchange Using a Random Deal of Cards
We consider the problem of multiparty secret key exchange. A \team" of players P1 through Pk wishes to determine an n-bit secret key in the presence of a compu-tationally unlimited eavesdropper, Eve. The team players are dealt hands of cards of prespeciied sizes from a deck of d distinct cards; any remaining cards are dealt to Eve. We explore how the team can use the information contained in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2539347